Declarative approach to cyclic steady state space refinement: periodic process scheduling
نویسندگان
چکیده
منابع مشابه
Declarative approach to cyclic steady state space refinement: periodic process scheduling
Problems of cyclic scheduling are usually observed in flexible manufacturing systems which produce multitype parts where the automated guided vehicle system plays the role of a material handling system, as well as in various other multimodal transportation systems where goods and/or passenger itinerary planning plays a pivotal role. The schedulability analysis of the processes executed in the s...
متن کاملCyclic Steady State Refinement
The paper presents a new modeling framework enabling to evaluate the cyclic steady state of a given system of concurrently flowing cyclic processes (SCCP) on the base of the assumed topology of transportation routes, dispatching rules employed, resources and operation times as well as an initial processes allocation. The objective is to provide the rules useful in the course of routing and sche...
متن کاملReachability of Cyclic Steady States Space: Declarative Modeling Approach
The paper presents a new modeling framework enabling to evaluate the cyclic steady state of a given system of concurrently flowing cyclic processes (SCCP) sharing common system resources while interacting on the base of a mutual exclusion protocol. Assuming a given topology of cyclic routes passing on by subsets of system resources, a set of dispatching rules aimed at recourses’ conflicts resol...
متن کاملCyclic Steady State Refinement: Multimodal Processes Perspective
The cyclic scheduling problem modeled in terms of Cyclic Concurrent Process Systems is considered. The problem can be seen as a kind of Diophantine problem, hence its solvability, i.e. schedulability, plays a pivotal role in many supply-chain problems. In contradiction to the traditionally offered solutions the approach proposed allows one to take into account such behavioral features as transi...
متن کاملSteady-State Scheduling
In this chapter, we propose a general framework for deriving efficient (polynomial-time) algorithms for steady-state scheduling. In the context of large scale platforms (grids or volunteer computing platforms), we show that the characteristics of the resources (volatility, heterogeneity) limit their use to large regular applications. Therefore, steady-state scheduling, that consists in optimizi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Advanced Manufacturing Technology
سال: 2013
ISSN: 0268-3768,1433-3015
DOI: 10.1007/s00170-013-4760-0